Capacity inverse minimum cost flow problems under the weighted Hamming distance

نویسندگان

  • Longcheng Liu
  • Enyu Yao
چکیده

Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow x becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. Here, we consider the capacity inverse problem under the bottleneck-type and the sum-type weighted Hamming distances. In the bottleneck-type case, the binary search technique is applied to present an algorithm for solving the problem in O(nm log n) time. In the sum-type case, it is shown that the inverse problem is strongly NP-hard even on bipartite networks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Capacity Inverse Minimum Cost Flow Problem under the Weighted Hamming Distances

Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. In this article, we consider the capac...

متن کامل

Inverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance

Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...

متن کامل

Capacity Inverse Minimum Cost Flow Problem under the Weighted Hamming Distances

Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow x becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. Here, we consider the capacity inver...

متن کامل

A Modified Algorithm for Solving the Inverse Minimum Cost Flow Problem under the Bottleneck-type Hamming Distance

Given an instance of the minimum cost flow problem, the corresponding inverse problem is to modify the arc costs as little as possible so that a given feasible flow becomes optimal to the modified minimum cost flow problem. In this article, we study this inverse problem in that the modifications are measured by the weighted bottleneck-type Hamming distance. We present a new efficient algorithm ...

متن کامل

On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance

Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Optimization Letters

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2016